Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus
نویسنده
چکیده
We prove lower bounds for a proof system having exponential speed-up over both polynomial calculus and constant-depth Frege systems in DeMorgan language.
منابع مشابه
A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems
We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime p (the so called AC[p] Frege systems) to computational complexity lower bounds for search tasks involving search trees branching upon values of maps on the vector space of low degree polynomials over Fp. In 1988 Ajtai [2] proved th...
متن کاملGenerating Matrix Identities and Proof Complexity
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of d × d matrices over a field F, is a non-commutative polynomial f(x1, . . . , xn) over F such that f vanishes on every d × d matrix assignment to its variables. We focus on arithmetic proofs, which are proofs of polyn...
متن کاملTel Aviv University the Raymond and Beverly Sackler Faculty of Exact Sciences School of Computer Science Studies in Algebraic and Propositional Proof Complexity
The field of proof complexity aims at characterizing which statements have short proofs in a given formal proof system. This thesis is a contribution to proof complexity broadly construed as the field that studies the sizes of structured or symbolic proofs. Our focus will be on the development and complexity-theoretic study of new frameworks, mainly of an algebraic nature, for providing, among ...
متن کاملAlgebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege, yielding a semantic way to define a Cook-Reckhow (i.e., polynomially verifiable) algebraic analog of Frege proofs, different from that given in Buss et al. (1997) and Grigoriev & Hirsch (2003). We ...
متن کاملA Exponential Lower Bounds for AC-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation which turns polynomial-size Frege proofs to subexponential-size AC0Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, since it is a longstanding open problem to prove super-polynomial lower bounds for Frege. Our construction is optimal for proofs of formulas of unbounded depth. As a consequence of our main result, we ...
متن کامل